#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;cin>>t;
  while(t--){
    LL n,k;cin>>n>>k;
    if(n<k){
        LL ans=ceil(1.0*k/(1.0*n));
        cout<<ans<<endl;
    }
    else if(n==k){
        cout<<1<<endl;
    }
    else if(n>k){
        LL cnt=0;
        if(n%k!=0) cnt=n/k+1;
        else cnt=n/k;
        k*=cnt;
        LL ans=ceil(1.0*k/(1.0*n));
        cout<<ans<<endl;
    }
  }
return 0;
}
